Dimension Reduction for Finite Trees in $$\varvec{\ell _1}$$ ℓ 1
نویسندگان
چکیده
منابع مشابه
Dimension Reduction for Finite Trees in ℓ 1
We show that every n-point tree metric admits a (1 + ε)-embedding into ` C(ε) logn 1 , for every ε > 0, where C(ε) ≤ O ( ( 1ε ) 4 log 1ε ) ) . This matches the natural volume lower bound up to a factor depending only on ε. Previously, it was unknown whether even complete binary trees on n nodes could be embedded in ` O(logn) 1 with O(1) distortion. For complete d-ary trees, our construction ach...
متن کاملDimension reduction for finite trees in l1
We show that every n-point tree metric admits a (1 + ε)-embedding into ` C(ε) logn 1 , for every ε > 0, where C(ε) ≤ O ( ( 1ε ) 4 log 1ε ) ) . This matches the natural volume lower bound up to a factor depending only on ε. Previously, it was unknown whether even complete binary trees on n nodes could be embedded in ` O(logn) 1 with O(1) distortion. For complete d-ary trees, our construction ach...
متن کاملDimension reduction in L 1 : a negative result
The Johnson-Lindenstrauss lemma shows that only d = O( 1 2 log n) dimensions are needed to embed any set of n points in L2 into `2 with distortion at most (1 + ). We will show that such dimension reduction is not possible in L1. In particular, we will give a set of n points in L1 that cannot be D-embedded into `1 unless d ≥ nΩ(1/D2). This result was originally shown by Brinkman and Charikar [1]...
متن کاملΣ _1^1 in Every Real in a Σ _1^1 Class of Reals Is Σ _1^1
We rst prove a theorem about reals (subsets of N) and classes of reals: If a real X is 1 in every member G of a nonempty 1 1 class K of reals then X is itself 1. We also explore the relationship between this theorem, various basis results in hyperarithmetic theory and omitting types theorems in !-logic. We then prove the analog of our rst theorem for classes of reals: If a class A of reals is...
متن کاملDimension reduction in principal component analysis for trees
The statistical analysis of tree structured data is a new topic in statistics with wide application areas. Some Principal Component Analysis (PCA) ideas were previously developed for binary tree spaces. In this study, we extend these ideas to the more general space of rooted and labeled trees. We re-define concepts such as tree-line and forward principal component tree-line for this more genera...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 2013
ISSN: 0179-5376,1432-0444
DOI: 10.1007/s00454-013-9536-7